Grafting Hypersequents onto Nested Sequents

نویسندگان

  • Roman Kuznets
  • Björn Lellmann
چکیده

·Ve introduce a new Gcn(zen-style framework of grafted hypc1rsequents that com\Jim's the fornrnlism of nested sequents with that of hyperscquents. To illustrate the potential of the frmnework. we present novel calculi for the modal logics K5 and KD5, m; well as for extensions of the modal logics K and KD with tlw axiom for shift rdlcxivity. Tlw latter of these extensions is also known as SDL + in the context oC dcontic logic. All our calculi enjoy syntactic cut elimination and can \Jc used in backwards proof search procedures of optimal complexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Labelled Tree Sequents, Tree Hypersequents and Nested (Deep) Sequents

We identify a subclass of labelled sequents called “labelled tree sequents” and show that these are notational variants of tree-hypersequents in the sense that a sequent of one type can be represented naturally as a sequent of the other type. This relationship can be extended to nested (deep) sequents using the relationship between tree-hypersequents and nested (deep) sequents, which we also sh...

متن کامل

Nested Sequents

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested sequents stay inside the modal language and allow for proof systems which enjoy the subformula property in the literal sense. In the first part we study a system...

متن کامل

Modal interpolation via nested sequents

The main method of proving the Craig Interpolation Property (CIP) constructively uses cut-free sequent proof systems. Until now, however, no such method has been known for proving the CIP using more general sequent-like proof formalisms, such as hypersequents, nested sequents, and labelled sequents. In this paper, we start closing this gap by presenting an algorithm for proving the CIP for moda...

متن کامل

Modular Sequent Systems for Modal Logic

We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t,b, 4, 5. These systems are modular in the sense that each axiom has a corresponding rule and each combination of these rules is complete for the corresponding frame conditions. The systems are based on nested sequents, a natural generalisation of hypersequents. Nested sequents stay inside...

متن کامل

Interpolation Method for Multicomponent Sequent Calculi

The proof-theoretic method of proving the Craig interpolation property was recently extended from sequents to nested sequents and hypersequents. There the notations were formalism-specific, obscuring the underlying common idea, which is presented here in a general form applicable also to other similar formalisms, e.g., prefixed tableaus. It describes requirements sufficient for using the method...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Logic Journal of the IGPL

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2016